Guarded logics: algorithms and bisimulation
نویسنده
چکیده
Diese Dissertation ist auf den Internetseiten der Hochschule online verfügbar. " Waterproof Cookies " 8.82oz / 250g margerine 8.82oz / 250g wheat flour 7.05oz / 200g sugar 3.53oz / 100g coconut rasps 1.76oz / 50g chocolate rasps 1.76oz / 50g candy sugar 2-3 eggs Separate the egg whites and whisk until solid. Make pastry out of other ingredients, including egg yolks. Finally add egg whites. Prepare baking tray and form cookies approx. 2 in. in diameter, 1/4 in. thick. Bake in oven at 392 • F / 200 • C until golden brown. Comments to [email protected].
منابع مشابه
The Freedoms of Guarded Bisimulation
Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi in [1]. Features otherwise known from modal logics are lifted to the richer setting of general relational structures. The leading idea in this generalisation is the relativisation of quantifiers to tuples that are guarded by relational atoms. In a sense that can be...
متن کاملA Lindström characterisation of the guarded fragment and of modal logic with a global modality
We establish a Lindström type characterisation of the extension of basic modal logic by a global modality (ML[∀]) and of the guarded fragment of first-order logic (GF) as maximal among compact logics with the corresponding bisimulation invariance and the Tarski Union Property.
متن کاملM ay 2 00 9 LINDSTRÖM THEOREMS FOR FRAGMENTS OF FIRST - ORDER LOGIC ∗
Lindström theorems characterize logics in terms of model-theoretic conditions such as Compactness and the Löwenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are fragments or extensions of fragments of first-order logic, e.g., k-variable logics and various modal logics. F...
متن کاملA Guarded negation
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded fragment of first-order logic and the guarded least fixpoint logic, respectively. They also extend the recently introduced unary negation fragment...
متن کاملDynamic Odds & Ends
Modal logic becomes action logic by adding programs as in propositional dynamic logic or the μ– calculus. Modal languages can be seen as decidable fragments of first-order logic that admit a natural bisimulation, and hence enjoy a good model theory. Recently, much stronger 'guarded fragments' of firstorder logic have been identified that enjoy the same pleasant features. The latter can serve as...
متن کامل